A Class of Variable Metric Decomposition Methods for Monotone Variational Inclusions
نویسندگان
چکیده
We extend the general decomposition scheme of [32], which is based on the hybrid inexact proximal point method of [38], to allow the use of variable metric in subproblems, along the lines of [23]. We show that the new general scheme includes as special cases the splitting method for composite mappings [25] and the proximal alternating directions method [13, 17] (in addition to the decomposition methods of [10, 42] that were already covered by [32]). Apart from giving a unified insight into the decomposition methods in question and openning the possibility of using variable metric, which is a computationally important issue, this development also provides linear rate of convergence results not previously available for splitting of composite mappings and for the proximal alternating directions methods.
منابع مشابه
A SYSTEM OF GENERALIZED VARIATIONAL INCLUSIONS INVOLVING G-eta-MONOTONE MAPPINGS
We introduce a new concept of general $G$-$eta$-monotone operator generalizing the general $(H,eta)$-monotone operator cite{arvar2, arvar1}, general $H-$ monotone operator cite{xiahuang} in Banach spaces, and also generalizing $G$-$eta$-monotone operator cite{zhang}, $(A, eta)$-monotone operator cite{verma2}, $A$-monotone operator cite{verma0}, $(H, eta)$-monotone operator cite{fanghuang}...
متن کاملOn the Monotone Mappings in CAT(0) Spaces
In this paper, we first introduce a monotone mapping and its resolvent in general metric spaces.Then, we give two new iterative methods by combining the resolvent method with Halpern's iterative method and viscosity approximation method for finding a fixed point of monotone mappings and a solution of variational inequalities. We prove convergence theorems of the proposed iterations in ...
متن کاملA class of decomposition methods for convex optimization and monotone variational inclusions via the hybrid inexact proximal point framework
We show that the decomposition method for convex programming proposed by Chen and Teboulle can be regarded as a special case in the hybrid inexact proximal point framework. We further demonstrate that the more general decomposition algorithms for variational inequalities introduced by Tseng are also either a special case in this framework or are very closely related to it. This analysis provide...
متن کاملA Class of Inexact Variable Metric Proximal Point Algorithms
For the problem of solving maximal monotone inclusions, we present a rather general class of algorithms, which contains hybrid inexact proximal point methods as a special case and allows for the use of a variable metric in subproblems. The global convergence and local linear rate of convergence are established under standard assumptions. We demonstrate the advantage of variable metric implement...
متن کامل2 5 Fe b 20 09 A PARALLEL SPLITTING METHOD FOR WEAKLY COUPLED MONOTONE INCLUSIONS ∗
A parallel splitting method is proposed for solving systems of coupled monotone inclusions in Hilbert spaces. Convergence is established for a wide class of coupling schemes. Unlike classical alternating algorithms, which are limited to two variables and linear coupling, our parallel method can handle an arbitrary number of variables as well as nonlinear coupling schemes. The breadth and flexib...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008